منابع مشابه
On optimal zero-preserving corrections for inconsistent linear systems
This paper addresses the problem of finding an optimal correction of an inconsistent linear system, where only the nonzero coefficients of the constraint matrix are allowed to be perturbed for reconstructing a consistent system. Using the Frobenius norm as a measure of the distance to feasibility, a nonconvex minimization problem is formulated, whose objective function is a sum of fractional fu...
متن کاملLinear Systems with Sign - Observations
This paper deals with systems that are obtained from linear time-invariant continuousor discrete-time devices followed by a function that just provides the sign of each output. Such systems appear naturally in the study of quantized observations as well as in signal processing and neural network theory. Results are given on observability, minimal realizations, and other systemtheoretic concepts...
متن کاملOn Optimal Correction of Inconsistent Linear Constraints
In practice one has often to deal with the problem of inconsistency between constraints, as the result, among others, of the complexity of real models. To overcome these conflicts we can outline two major actions: removal of constraints or changes in the coefficients of the model. This last approach, that can be generically described as “model correction” is the problem we address in this paper...
متن کاملTrichotomy for Integer Linear Systems Based on Their Sign Patterns
In this paper, we consider solving the integer linear systems, i.e., given a matrix A ∈ Rm×n, a vector b ∈ R, and a positive integer d, to compute an integer vector x ∈ D such that Ax ≥ b, where m and n denote positive integers, R denotes the set of reals, and D = {0, 1, . . . , d − 1}. The problem is one of the most fundamental NP-hard problems in computer science. For the problem, we propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1999
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(99)00130-5